A Sliding Window Technique for Open Data Mining over Data Streams
نویسندگان
چکیده
منابع مشابه
Sliding Window Query Processing over Data Streams
Database management systems (DBMSs) have been used successfully in traditional business applications that require persistent data storage and an efficient querying mechanism. Typically, it is assumed that the data are static, unless explicitly modified or deleted by a user or application. Database queries are executed when issued and their answers reflect the current state of the data. However,...
متن کاملCASW: Context Aware Sliding window for Frequent Itemset Mining over Data Streams
In recent years, advances in both hardware and software technologies coupled with high-speed data generation has led to data streams and data stream mining. Data generation has been much faster in data stream applications and scores of data is generated in quick turnaround time. Hence it becomes obvious to perform mining, data on arrival that is usually termed as data stream mining. General fre...
متن کاملAn Efficient Sliding Window Based Algorithm for Adaptive Frequent Itemset Mining over Data Streams
Mining frequent itemsets over high speed, continuous and infinite data streams is a challenging problem due to changing nature of data and limited memory and processing capacities of computing systems. Sliding window is an interesting model to solve this problem since it does not need the entire history of received transactions and can handle concept change by considering only a limited range o...
متن کاملOn Concurrency Control in Sliding Window Queries over Data Streams
Data stream systems execute a dynamic workload of long-running and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, windows may be advanced periodically by replacing the oldest part of the window with a batch of newly arrived data. Existing work on stream processing assumes that a window cannot be advanced while it is being accessed by a query. I...
متن کاملEfficient Mining of High Utility Patterns over Data Streams with a Sliding Window Method
High utility pattern (HUP) mining over data streams has become a challenging research issue in data mining. The existing sliding window-based HUP mining algorithms over stream data suffer from the level-wise candidate generationand-test problem. Therefore, they need a large amount of execution time and memory. Moreover, their data structures are not suitable for interactive mining. To solve the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartD
سال: 2005
ISSN: 1598-2866
DOI: 10.3745/kipstd.2005.12d.3.335